Deterministic quantum search with adjustable parameters: Implementations and applications

Grover's algorithm provides a quadratic speedup over classical algorithms to search for marked elements in an unstructured database. The original is probabilistic, and there are several schemes achieve the deterministic version, by using generalized iteration G(α,β):=Sr(β)So(α). However, all existing value range of α β limited; instance, three early they determined proportion states M/N. In this paper, we break through limitation presenting framework with adjustable parameters, which allows or be arbitrarily given. significance lies not only expansion mathematical form, but also its application value, as present two disparate problems able solve deterministically proposed framework, whereas previous ineffective.